Protecting a Distributed Voting Schema for Anonymous and Secure Voting Against Attacks of Malicious Partners

نویسندگان

  • Sebastian Obermeier
  • Stefan Böttcher
چکیده

A distributed protocol is presented for anonymous and secure voting that is failure-tolerant with respect to malicious behavior of individual participants and that does not rely on a trusted third party. The proposed voting protocol was designed to be executed on a fixed group of N known participants, each of them casting one vote that may be a vote for abstention. Several attack vectors on the protocol are presented, and the detection of malicious behavior like spying, suppressing, inventing, and modifying protocol messages or votes by the protocol is shown. If some participants stop the protocol, a fair information exchange is achieved in the sense that either all votes are guaranteed to be valid and accessible to all participants, or malicious behavior has been detected and the protocol is stopped, but the votes are not disclosed.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Decentralized Voting Algorithm for Increasing Dependability in Distributed Systems

Replication and majority voting are well-known and widely-used methods for achieving fault-tolerance in distributed systems. An open area of investigation is coordinating the voting in a secure manner, so as to withstand malicious attacks. The Timed-Buffer Distributed Voting Algorithm (TB-DVA), a secure distributed voting protocol, is introduced for this purpose. It is contrasted with several o...

متن کامل

CodeVoting: protecting against malicious vote manipulation at the voter's PC

Voting in uncontrolled environments, such as the Internet comes with a price, the price of having to trust in uncontrolled machines the collection of voter’s vote. An uncontrolled machine, e.g. the voter’s PC, may be infected with a virus or other malicious program that may try to change the voter’s vote without her knowledge. Here we present CodeVoting, a technique to create a secure communica...

متن کامل

Random Key Pre-Distribution Techniques against Sybil Attacks

Sybil attacks pose a serious threat for Wireless Sensor Networks (WSN) security. They can create problems in routing, voting schemes, decision making, distributed storage and sensor re-programming. In a Sybil attack, the attacker masquerades as multiple sensor identities that are actually controlled by one or a few existing attacker nodes. Sybil identities are fabricated out of stolen keys, obt...

متن کامل

Distributed quantum election scheme

In an electronic voting protocol, a distributed scheme can be used for forbidding the malicious acts of the voting administrator and the counter during the election, but it cannot prevent them from collaborating to trace the ballots and destroy their privacy after the election. We present a distributed anonymous quantum key distribution scheme and further construct a distributed quantum electio...

متن کامل

Securing e-voting against MITM attacks

Man in the middle attacks involve the interception and retransmission of electronic messages in a way that the original parties will presume that their communication is secure. Such an attack could be a threat to any electronic voting scenario. This paper proposes a novel method for preventing this kind of attacks by including in the transaction a challenge-response test. The human end-user is ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IJESMA

دوره 3  شماره 

صفحات  -

تاریخ انتشار 2011